Representation theorems using DOS languages

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representation Theorems for Quantales

In this paper we prove that any quantale Q is (isomorphic to) a quantale of suitable relations on Q. As a consequence two isomorphism theorems are also shown with suitable sets of functions of Q into Q. These theorems are the mathematical background one needs in order to give natural and complete semantics for (non-commutative) Linear Logic using relations. 1991 Mathematics Subject Classificati...

متن کامل

Representation Theorems and Realism

The representation theorems of expected utility theory show that having certain types of preferences is both necessary and sufficient for being representable as having subjective probabilities. However, unless the expected utility framework is simply assumed, such preferences are also consistent with being representable as having degrees of belief that do not obey the laws of probability. This ...

متن کامل

Using Representation Theorems for Proving Polynomials Non-negative

Proving polynomials non-negative when variables range on a subset of numbers (e.g., [0,+∞)) is often required in many applications (e.g., in the analysis of program termination). Several representations for univariate polynomials P that are non-negative on [0,+∞) have been investigated. They can often be used to characterize the property, thus providing a method for checking it by trying a matc...

متن کامل

Representation Theorems for Hypergraph Satisfiability

Given a set of propositions, one can consider its inconsistency hypergraph. Then the satisfiability of sets of clauses with respect to that hypergraph (see [1], [6]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countabl...

متن کامل

Representation Theorems for Petri Nets

This paper retraces, collects, summarises, and mildly extends the contributions of the authors — both together and individually — on the theme of representing the space of computations of Petri nets in its mathematical essence.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1982

ISSN: 0304-3975

DOI: 10.1016/0304-3975(82)90089-5